منابع مشابه
Approximation by Conic Splines
We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance ε is c1ε +O(1), if the spline consists of parabolic arcs, and c2ε + O(1), if it is composed of general conic arcs of varying type. The constants c1 and c2 are expressed in the Euclidean and affine curvature of the curve. We also show that...
متن کاملConic Approximation of Convolution Curve
Given two planar curves, a convolution curve is computed by applying vector sums to all pairs of curve points which have the same curve normal direction. The convolution curve can be used to compute Minkowski sum of two planar objects which is important in various geometric computations such as collision detection and font design. In this paper, we present an algorithm to generate a conic appro...
متن کاملGeometric Conic Spline Approximation in Cagd
We characterize the best geometric conic approximation to regular plane curve and verify its uniqueness. Our characterization for the best geometric conic approximation can be applied to degree reduction, offset curve approximation or convolution curve approximation which are very frequently occurred in CAGD(Computer Aided Geometric Design). We also present the numerical results for these appli...
متن کاملHigh-order approximation of conic sections by quadratic splines
Given a segment of a conic section in the form of a rational Bézier curve, a quadratic spline approximation is constructed and an explicit error bound is derived. The convergence order of the error bound is shown to be O(h) which is optimal, and the spline curve is both C and G. The approximation method is very efficient as it is based on local Hermite interpolation and subdivision. The approxi...
متن کاملOn conic QPCCs, conic QCQPs and completely positive programs
This paper studies several classes of nonconvex optimization problems defined over convex cones, establishing connections between them and demonstrating that they can be equivalently formulated as convex completely positive programs. The problems being studied include: a conic quadratically constrained quadratic program (QCQP), a conic quadratic program with complementarity constraints (QPCC), ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1997
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0090